Performance of Zero forcing Pre-coder for Vectored DSL
نویسندگان
چکیده
منابع مشابه
On the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کاملMIMO Zero-Forcing Detection Performance Evaluation by Holonomic Gradient Method
We have recently derived infinite-series expressions for performance measures of multiple-input multipleoutput (MIMO) spatial multiplexing with zero-forcing detection (ZF) for Rician–Rayleigh fading, which is relevant in heterogeneous networks. These expressions ensue from a well-known infinite-series expansion around σ = 0 of the confluent hypergeometric function 1F1(·, ·, σ). Theoretically, t...
متن کاملassessment of the park- ang damage index for performance levels of rc moment resisting frames
چکیده هدف اصلی از طراحی لرزه ای تامین ایمنی جانی در هنگام وقوع زلزله و تعمیر پذیر بودن سازه خسارت دیده، پس از وقوع زلزله است. تجربه زلزله های اخیر نشان داده است که ساختمان های طراحی شده با آیین نامه های مبتنی بر نیرو از نظر محدود نمودن خسارت وارده بر سازه دقت لازم را ندارند. این امر سبب پیدایش نسل جدید آیین نامه های مبتنی بر عملکرد شده است. در این آیین نامه ها بر اساس تغییرشکل های غیرارتجاعی ...
15 صفحه اولConstrained space-time zero-forcing pre-equalizer for the downlink channel of UMTS-TDD
The great diversity of services expected to be delivered by third generation mobile radio systems will impose severe operating conditions on the mobile terminal in terms of computational requirements and power consumption. Therefore, in this work we propose to move the most demanding signal processing tasks, usually performed by the mobile unit, to the base station. This technique is developed ...
متن کاملZero forcing number of graphs
A subset S of initially infected vertices of a graph G is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbour, infects this neighbour. The forcing number of G is the minimum cardinality of a forcing set in G. In the present paper, we study the forcing number of various classes o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Electronics and Communication Engineering
سال: 2016
ISSN: 2278-8735,2278-2834
DOI: 10.9790/2834-1104026468